Locally Random Reductions in Interactive Complexity Theory
نویسنده
چکیده
We survey deenitions, known results, and open questions in the area of locally random reductions and explore the ramiications of these reductions in complexity theory.
منابع مشابه
Lower Bounds on Random-Self-Reducibility
Informally speaking, a function f is random-self-reducible if, for any x, the computation of f(x) can be reduced to the computation of f on other \randomly chosen" inputs. Such functions are fundamental in many areas of theoretical computer science, including lower bounds, pseudorandom number-generators, interactive proof systems, zero-knowledge, instance-hiding, program-checking, and program-t...
متن کاملThe Impact of the Objective Complexity and Product of Work Task on Interactive Information Searching Behavior
Background and Aim: this study aimed to explore the impact of objective complexity and Product of work task on user's interactive information searching behavior. Method: The research population consisted of MSc students of Ferdowsi university of Mashhad enrolled in 2012-13 academic year. In 3 stages of sampling (random stratified, quota, and voluntary sampling), 30 cases were selected. Each of ...
متن کاملTwo Remarks on Self-Correctability versus Random-Self-Reducibility
We examine the relationship between two types of probabilistic self-reductions that play crucial roles in the theory of interactive proof systems, program-checking, and program-testing: selfcorrectors and random-self-reductions. It is well known [4] that if a function is random-selfreducible, then it is also self-correctable; indeed all known self-correctors use some form of random-self-reducib...
متن کاملHierarchical MCMC Sampling
We maintain that the analysis and synthesis of random fields is much faster in a hierarchical setting. In particular, complicated longrange interactions at a fine scale become progressively more local (and therefore more efficient) at coarser levels. The key to effective coarsescale activity is the proper model definition at those scales. This can be difficult for locally-coupled models such as...
متن کاملOn the Computational Power of Locally Random Reductions∗
We study the computational complexity of languages L that have a nonadaptive (t(n), k(n), (n))-locally random reduction (lrr) to any target function g. Such a reduction is a probabilistic polynomial-time oracle algorithm for deciding L using nonadaptive queries to g, and has the following properties: the number of queries is k(n), the error probability is 1/2 − (n), and the distribution on t(n)...
متن کامل